Expressiveness and definability in circumscription
نویسندگان
چکیده
منابع مشابه
Expressiveness and Definability in Circumscription
We investigate expressiveness and definability issues with respect to minimal models, particularly in the scope of Circumscription. First, we give a proof of the failure of the Löwenheim-Skolem Theorem for Circumscription. Then we show that, if the class of P ;Z-minimal models of a first-order sentence is ∆elementary, then it is elementary. That is, whenever the circumscription of a firstorder ...
متن کاملCircumscription and Definability
Thanks to two stronger versions of predicate circumscription (one of the best known non-monotonic reasoning methods), we give a definitive answer to two old open problems. The first one is the problem of expressing domain circumscription in terms of predicate circumscription. The second one is the problem of definability of the circumscribed predicates, asked by Doyle in 1985, and never answere...
متن کاملComparing spiritual intelligence and emotional expressiveness in psychosomatic patients
The most important issues of psychology is psychosomatic disease. This study aimed to compare spiritual intelligence and emotional expression in patients with irritable bowel syndrome, coronary heart disease and asthma. This research was a post-event descriptive study. The statistical population included patients with coronary heart disease, irritable bowel syndrome and asthma that attended Ima...
متن کاملCircumscription and Implicit Deenability
We explore some connections between the technique of circumscription in artiicial intelligence and the notion of implicit deenition in mathematical logic. Implicit deenition can be taken as the informal intent, but not necessarily the formal result, of circumscription. This raises some questions for logical theory and suggests some implications for artiicial intelligence practice. The principal...
متن کاملStable models and circumscription
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programming. In this paper we propose a new definition of that concept, which covers many constructs used in answer set programming and, unlike the original definition, refers neither to grounding nor to fixpoints. It is based ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Manuscrito
سال: 2011
ISSN: 0100-6045
DOI: 10.1590/s0100-60452011000100011